Insertion and Deletion Closure of Languages
نویسندگان
چکیده
To a given language L, we associate the sets ins(L) (resp. &l(L)) consisting of words with the following property: their insertion into (deletion from) any word of L yields words which also belong to L. Properties of these sets and of languages which are insertion (deletion) closed are obtained. Of special interest is the case when the language is ins-closed (del-closed) and finitely generated. Then the minimal set of generators turns out to be a maximal prefix and suffix code, which is regular if L is regular. In addition, we study the insertion-base of a language and languages which have the property that both they and their complements are ins-closed.
منابع مشابه
K−insertion and k−deletion closure of languages
The operation of k−insertion (k−deletion) is a generalization of the catenation (quotient) of words and languages. The k−insertion of w into u = u1u2 consists of all words u1wu2 where the length of u2 is at most k (k−deletion is performed in a analogous fashion). To a language L we associate the set k−ins(L) (k−del(L)) consisting of words with the following property: their k−insertion into (k−d...
متن کاملPower of controlled insertion and deletion.dvi
The paper investigates classes of languages obtained as the closure of certain atomic languages under some insertion and deletion operations. Each of the classes studied is closed under an insertion operation, a deletion operation and an iterative insertion one. The operations are controlled and have been chosen as stated in order to allow an increase as well as a decrease of the length of the ...
متن کاملInsertion and Deletion for Involution Codes
This paper introduces a generalization of the operation of catenation: u[k]lv, the left-k-insertion, is the set of all words obtained by inserting v into u in positions that are at most k letters away from the left extremity of the word u. We define k-suffix codes using the left-kinsertion operation and extend the concept of k-prefix and k-suffix codes to involution k-prefix and involution k-su...
متن کاملBlock insertion and deletion on trajectories
In this paper, we introduce block insertion and deletion on trajectories, which provide us with a new framework to study properties of language operations. With the parallel syntactical constraint provided by trajectories, these operations properly generalize several sequential as well as parallel binary language operations such as catenation, sequential insertion, k-insertion, parallel inserti...
متن کاملShuffle and scattered deletion closure of languages
We introduce and study the notion of shu e residual of a language L: the set containing the words whose shu e with L is completely included in L. Several properties and a characterization of the shu e residual of a language are obtained. The shu e closure of a language L (the smallest language that is shu e closed and contains L) is investigated. Moreover, conditions for the existence of maxima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 183 شماره
صفحات -
تاریخ انتشار 1997